Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

IF4(true, true, x, y) -> LOGITER2(x, y)
LOGITER2(x, y) -> LE2(s1(0), x)
QUOT2(s1(x), s1(y)) -> QUOT2(minus2(x, y), s1(y))
LOG1(x) -> LOGITER2(x, 0)
LOGITER2(x, y) -> LE2(s1(s1(0)), x)
LOGITER2(x, y) -> IF4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
LE2(s1(x), s1(y)) -> LE2(x, y)
LOGITER2(x, y) -> QUOT2(x, s1(s1(0)))
MINUS2(s1(x), s1(y)) -> MINUS2(x, y)
LOGITER2(x, y) -> INC1(y)
INC1(s1(x)) -> INC1(x)
QUOT2(s1(x), s1(y)) -> MINUS2(x, y)

The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

IF4(true, true, x, y) -> LOGITER2(x, y)
LOGITER2(x, y) -> LE2(s1(0), x)
QUOT2(s1(x), s1(y)) -> QUOT2(minus2(x, y), s1(y))
LOG1(x) -> LOGITER2(x, 0)
LOGITER2(x, y) -> LE2(s1(s1(0)), x)
LOGITER2(x, y) -> IF4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
LE2(s1(x), s1(y)) -> LE2(x, y)
LOGITER2(x, y) -> QUOT2(x, s1(s1(0)))
MINUS2(s1(x), s1(y)) -> MINUS2(x, y)
LOGITER2(x, y) -> INC1(y)
INC1(s1(x)) -> INC1(x)
QUOT2(s1(x), s1(y)) -> MINUS2(x, y)

The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 5 SCCs with 6 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

INC1(s1(x)) -> INC1(x)

The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


INC1(s1(x)) -> INC1(x)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( INC1(x1) ) = max{0, x1 - 2}


POL( s1(x1) ) = x1 + 3



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LE2(s1(x), s1(y)) -> LE2(x, y)

The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


LE2(s1(x), s1(y)) -> LE2(x, y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( LE2(x1, x2) ) = max{0, x2 - 2}


POL( s1(x1) ) = x1 + 3



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MINUS2(s1(x), s1(y)) -> MINUS2(x, y)

The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


MINUS2(s1(x), s1(y)) -> MINUS2(x, y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( MINUS2(x1, x2) ) = max{0, x2 - 2}


POL( s1(x1) ) = x1 + 3



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

QUOT2(s1(x), s1(y)) -> QUOT2(minus2(x, y), s1(y))

The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


QUOT2(s1(x), s1(y)) -> QUOT2(minus2(x, y), s1(y))
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( QUOT2(x1, x2) ) = max{0, x1 - 2}


POL( s1(x1) ) = x1 + 3


POL( minus2(x1, x2) ) = x1



The following usable rules [14] were oriented:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

IF4(true, true, x, y) -> LOGITER2(x, y)
LOGITER2(x, y) -> IF4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))

The TRS R consists of the following rules:

minus2(x, 0) -> x
minus2(s1(x), s1(y)) -> minus2(x, y)
quot2(0, s1(y)) -> 0
quot2(s1(x), s1(y)) -> s1(quot2(minus2(x, y), s1(y)))
le2(0, y) -> true
le2(s1(x), 0) -> false
le2(s1(x), s1(y)) -> le2(x, y)
inc1(s1(x)) -> s1(inc1(x))
inc1(0) -> 0
log1(x) -> logIter2(x, 0)
logIter2(x, y) -> if4(le2(s1(0), x), le2(s1(s1(0)), x), quot2(x, s1(s1(0))), inc1(y))
if4(false, b, x, y) -> logZeroError
if4(true, false, x, s1(y)) -> y
if4(true, true, x, y) -> logIter2(x, y)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.